web dage inform manag waim intern workshop iwgd probabilist path queri road network traffic uncertainti awar path select correl hide independ mask neighbor queri friendli compress social network context dawar rank web search context search queri search engin meaning hint answer current queri previou studi context awar search focus develop context model limit small scale investig control laboratori set context awar rank web search critic problem larg remain unsolv advantag type context rank integr context inform rank model paper tackl essenti problem analyt empir develop rank principl type context adopt learn rank approach integr rank principl state art rank model encod context inform featur model empir test approach larg search log data set obtain major commerci search engin evalu human judgment implicit user click data experiment result show context awar rank approach improv rank commerci search engin ignor context inform method outperform baselin method consid context inform rank search brows log mine web inform retriev challeng search system log footstep quantil summari entir histori quantil crucial type order statist databas extens research focus maintain space effici structur approxim quantil comput underli dataset updat exist solut design support current updat snapshot dataset queri past version data answer paper studi problem histor quantil search object enabl approxim quantil retriev snapshot dataset histori problem import analyz evolut distribut monitor qualiti servic queri optim tempor databas present formal result literatur prove theoret lower bound space cost support approxim histor quantil queri bound reveal fundament differ answer quantil queri past present time propos structur find approxim histor quantil show consum space lower bound squarelogarithm factor extens experi demonstr practic techniqu perform predict theori quantil return remark accur theoret precis guarante web search fbrows log mine challeng method applic understand section queri document match understand user inform context dawar citat recommend abstract scientif literatur rich metadata repres label direct graph graph represent enabl number scientif task ad hoc retriev name entiti recognit ner formul type proxim queri graph popular proxim measur call random walk restart rwr work supervis learn rwr measur associ edg label paramet paper describ learnabl proxim measur weight edg label sequenc proxim defin weight combin simpl path expert sequenc label edg experi task subdomain biologi show learn method significantli outperform rwr model train untrain extend method support addit type expert model intrins properti entiti queri independ expert gener pagerank measur popular entiti expert rank adjust entiti import hierarch distribut data classif wireless sensor network hierarch distribut data classif wireless sensor network probabilist revers nearest neighbor queri uncertain data abstract uncertain data inher import applic revers nearest neighbor rnn queri import queri type applic type queri studi uncertain data previou work answer rnn queri uncertain data paper formal probabilist revers nearest neighbor queri retriev object uncertain data higher probabl threshold rnn uncertain queri object develop effici algorithm base prune approach solv probabilist rnn queri multidimension uncertain data experiment result demonstr algorithm effici sampl base approxim algorithm case highli scalabl supersed nearest neighbor search uncertain spatial databas paper propos problem call supersed nearest neighbor search uncertain spatial databas object multidimension probabl densiti function queri point object nearest neighbor nn candid probabl nn nn candid supersed closer object supersed nearest neighbor snn supersed nn candid object supersed nn candid case return snncore minimum set nn candid supersed nn candid snn core intuit snn core object object snn core wors object snn core show snn core effici comput util convent multidimension index confirm extens experi explor diseas associ nhane data data mine document cluster scientif text citat context progress load balanc distribut comput case studi skylin analysi binari decis diagram base approach mine frequent subsequ comput close skycub paper tackl problem effici skycub comput introduc approach significantli reduc domin test subspac number subspac search technic identifi type skylin point directli deriv domin test base formal concept analysi introduc closur oper enabl concis represent skylin cube show concis represent easi comput develop effici algorithm search small portion huge search space show empir result merit approach survei sequenc classif mine discrimin item multipl data stream maintain dynam profil captur user read interest common interest queri ask time frequent search engin user asia north america keyword tag time frequent blog stream comput game blog stream hollywood movi answer interest question find discrimin item multipl data stream data sourc web search queri region blog post topic model data stream due fast grow volum sourc motiv extens applic thesi studi problem mine discrimin item multipl data stream show find discrimin item stream stream scan space lower bound log alphabet item current size tackl space challeng develop heurist algorithm achiev high precis recal linear space linear process time proceed st acm sigkdd workshop knowledg discoveri uncertain data advanc data web manag advanc data mine applic advanc data mine applic requir support relat databas engin cluster applic high dimension featur space demand proper support multipl top queri order perform project cluster research tackl problem optim restrict rank top queri solut singl rank criterion deficit optim multipl topk queri join target paper perspect hand propos minim handi extens sql express multipl top queri hand propos optim hash join strategi effici execut type queri extens experi conduct context show feasibl propos detect topic evolut scientif literatur citat understand topic scientif literatur evolv interest import problem previou work simpli model paper bag word consid impact author impact document captur citat import inher element scientif literatur consid paper address problem understand topic evolut leverag citat develop citat awar approach propos iter topic evolut learn framework adapt latent dirichlet alloc model citat network develop inherit topic model evalu effect effici approach compar state art approach larg collect research paper year citat network enabl citeseerx result show citat understand topic evolut debt detect social secur sequenc classif posit neg pattern mapo mine recommend api usag pattern answer aggreg keyword queri relat databas minim group dby person entiti detect recommend fusion web log mine techniqu effici index shortest path exploit symmetri graph continu privaci preserv publish data stream recent privaci preserv data publish receiv lot attent research applic previou studi focu static data set paper studi emerg problem continu privaci preserv publish data stream solv straightforward extens exist privaci preserv publish method static data tackl problem develop approach consid distribut data entri publish statist distribut data stream extens perform studi real data set synthet data set verifi effect effici method onlin interv skylin queri time seri privaci preserv publish multipl quasi didentifi distanc dbase repres skylin abstract integ arepres skylin skylin point describ tradeoff dimens offer full skylin topic previous studi exist solut produc point arbitrarili tini cluster fail repres motiv propos definit repres skylin minim distanc repres skylin point nearest repres studi algorithm comput distanc base repres skylin space dynam program algorithm guarante optim solut dimension prove problem np hard give approxim polynomi time algorithm multidimension access method algorithm directli report repres skylin retriev full skylin show repres skylin captur contour entir skylin previou method comput faster earli predict time seri nearest neighbor approach paper formul problem earli classif time seri data import time sensit applic healthinformat introduc concept mpl minimum predict length develop ect earli classif time seri effect nearest neighbor classif method ect make earli predict time retain accuraci compar nn classifi full length time seri empir studi benchmark time seri data set show ect work real data set nn classif effect learn templat dindepend wrapper new articl extract singl train site olap search log infrastructur support data ddriven applic search engin search log rich date inform user prefer critic data sourc search engin recent data driven applic develop search engin understand import collabor dauthorship network support analysi approach mobilemin real world case studi data mine mobil commun new articl extract templat dindepend wrapper problem templat independ new extract state art new extract method base templat level wrapper induct limit correctli extract page belong unseen templat wrapper templat gener costli maintain date wrapper hundr websit chang templat lead invalid wrapper paper formal new extract machin learn problem learn templat independ wrapper small number label new page singl site featur dedic new titl bodi develop correl new titl new bodi exploit templat independ wrapper extract new page site templat experi wrapper learn page singl new site achiev accuraci new page new site context dawar search learn larg variabl length hidden markov model search log captur context user queri previou queri click session understand user inform context awar approach document rank queri suggest url recommend improv user search experi substanti paper propos gener approach context awar search captur context queri learn variabl length hidden markov model vlhmm search session extract log data mathemat model intuit learn larg vlhmm million state hundr million search session pose grand challeng develop strategi paramet initi vlhmm learn greatli reduc number paramet estim practic devis method distribut vlhmm learn map reduc model test approach real data set consist billion queri billion click million search session evalu effect vlhmm learn real data search applic document rank queri suggest url recommend experiment result show approach effect effici anonym dbase attack privaci dpreserv data publish data publish gener concern protect individu privaci recent studi case adversari possess kind knowledg data articl show knowledg mechan algorithm anonym data public lead extra inform assist adversari jeopard individu privaci mechan minim inform loss attempt loophol attack call attack minim attack articl introduc model call confidenti deal minim attack propos feasibl solut experi show minim attack practic concern real dataset algorithm prevent attack overhead inform loss associ rule problem discov associ rule item larg databas sale transact present algorithm solv problem fundament algorithm empir evalu show algorithm outperform algorithm factor rang small problem order magnitud larg problem show featur propos algorithm combin hybrid algorithm call apriorihybrid scale experi show apriorihybrid scale linearli number transact apriorihybrid excel scale properti respect transact size number item databas introduct progress bar code technolog made retail organ collect store massiv amount sale data refer basket data record data typic consist tran anonym dbase attack privaci dpreserv data publish data publish gener concern protect individu privaci recent studi case adversari possess kind knowledg data articl show knowledg mechan algorithm anonym data public lead extra inform assist adversari jeopard individu privaci mechan minim inform loss attempt loophol attack call attack minim attack articl introduc model call confidenti deal minim attack propos feasibl solut experi show minim attack practic concern real dataset algorithm prevent attack overhead inform loss orthoclusterdb onlin platform synteni block anonym worst dcase distribut dbase background knowledg continu monitor top dk uncertain data stream probabilist threshold method onlin skylin analysi dynam prefer nomin attribut abstract import skylin analysi recogn multicriteria decis make applic previou studi assum fix order attribut question applic user interest skylin respect total partial order nomin attribut paper identifi tackl problem onlin skylin analysi dynam prefer nomin attribut investig order attribut lead skylin address type interest queri viewpoint queri return respect order point skylin refin skylin queri retriev skylin respect specif order develop method systemat report extens perform studi synthet real data set verifi effect effici method index term skylin materi data warehous prefer continu dmean monitor low report cost sensor network pad simpl effect pattern dawar dynam search method fast maxim frequent pattern mine summari acm sigkdd workshop knowledg discoveri uncertain data mine frequent cross dgraph quasi dcliqu link spam target detect page farm top dk typic queri effici queri answer method larg databas typic queri effici queri answer method larg databas anonym continu data publish anonym import privaci protect mechan data publish great deal work recent year consid singl static releas mechan protect data releas recipi practic applic data publish continu data arriv data anonym differ purpos recipi scenario releas properli anonym anonym individu unintention compromis recipi cross examin releas receiv collud recipi prevent attack call correspond attack face major challeng paper systemat character correspond attack propos effici anonym algorithm thwart attack model continu data publish orthoclust tool mine synteni block applic compar genom compar genom close distal relat speci compar genom analysi character structur function genom conserv diverg region synteni block conserv block gene chromosom relat speci plai import role compar genom analysi tool design identifi synteni block handl challeng applic requir stranded gene gene invers gene duplic comparison genom develop publicli data mine tool orthoclust handl challeng orthoclust take annot gene set candid genom pairwis ortholog relationship input effici identifi complet set synteni block addit orthoclust identifi type genom rearrang event invers transposit insert delet reciproc transloc flexibl applic scenario orthoclust systemat set paramet synteni block size number mismatch allow stranded enforc gene order preserv orthoclust identifi segment duplic genom paper introduc major technic idea present interest find orthoclust effici answer probabilist threshold top dk queri uncertain data uncertain data inher import applic environment surveil mobil object track top queri rank queri natur analyz uncertain data applic paper studi problem answer probabilist threshold top queri uncertain data comput uncertain record take probabl top list user probabl threshold present effici exact algorithm fast sampl algorithm empir studi real synthet data set verifi effect probabilist threshold top queri effici method preserv privaci social network neighborhood attack abstract recent social network data publish preserv privaci publish social network data import concern local knowledg individu social network adversari attack privaci victim easili previou studi privaci preserv deal relat data appli social network data paper initi preserv privaci social network data identifi essenti type privaci attack neighborhood attack adversari knowledg neighbor target victim relationship neighbor victim identifi social network victim ident preserv convent anonym techniqu show problem challeng present practic solut battl neighborhood attack empir studi anonym social network gener method answer aggreg network queri high accuraci dimac disguis miss data clean tool mine prefer superior inferior exampl mine user prefer plai critic role import applic custom relationship manag crm product servic recommend market campaign paper identifi interest practic problem mine user prefer multidimension space user prefer categor attribut unknown superior inferior exampl provid user learn user prefer categor attribut model problem systemat show mine user prefer superior inferior exampl challeng problem great potenti practic knowledg explor systemat attempt tackl problem propos greedi method show method practic real data set synthet data set context dawar queri suggest mine click dthrough session data semant web extens world wide web enabl peopl share content boundari applic websit current search engin plai import central role current web infrastructur document rank algorithm core search engin similarli fast qualiti dguarante data stream resourc dconstrain sensor network spamic approach web spam detect web spam refer deliber action bring select web page unjustifi favor relev import major obstacl high qualiti inform retriev web exist web spam detect method supervis requir larg repres train set web page assum global inform larg web graph snapshot larg collect web page situat assumpt hold paper studi problem unsupervis web spam detect introduc notion spamic measur page spam spamic flexibl user control measur tradit supervis classif method propos effici onlin link spam term spam detect method spamic method train cost effect real data set evalu effect effici method mine sequenc classifi earli predict supervis learn sequenc data sequenc classif recogn import data mine task signific applic tempor order import sequenc data critic applic sequenc classif medic diagnosi disast predict earli predict highli desir featur sequenc classifi earli predict sequenc classifi prefix sequenc short make accur predict knowledg earli predict sequenc data studi systemat paper identifi problem mine sequenc classifi earli predict analyz problem challeng attempt tackl problem propos interest method sequenti classif rule scr method mine set sequenti classif rule classifi call earli predict util defin select featur rule gener sequenti decis tree gsdt method adopt divid conquer strategi gener classif model conduct extens empir evalu real data set interestingli method achiev accuraci compar stateof art method typic short prefix sequenc result earli predict highli feasibl effect dimac system clean disguis miss data queri answer techniqu uncertain probabilist data tutori summari uncertain data inher import applic environment surveil market analysi quantit econom research due import applic rapidli increas amount uncertain data collect accumul analyz larg collect uncertain data import task attract interest databas commun recent uncertain data manag emerg hot area databas research develop tutori systemat review repres studi answer queri uncertain probabilist data rank queri uncertain data probabilist threshold approach uncertain data inher import applic environment surveil mobil object track top queri rank queri natur analyz uncertain data applic paper studi problem answer probabilist threshold top queri uncertain data comput uncertain record take probabl top list user probabl threshold present effici exact algorithm fast sampl algorithm poisson approxim base algorithm empir studi real synthet data set verifi effect probabilist threshold top queri effici method pled person entiti detect system base web log mine techniqu fast qualiti dguarante data stream resourc dconstrain sensor network anonym local recod data attribut hierarch taxonomi abstract individu privaci risk publish data set properli deidentifi anonym major techniqu deidentifi data set number anonym scheme local recod method promis minim distort anonym view paper address major issu local recod anonym attribut hierarch taxonomi defin proper distanc metric achiev local recod gener small distort propos mean control inconsist attribut domain gener view local recod show experiment propos local recod method base propos distanc metric produc higher qualiti anonym tabl qualiti measur global recod anonym method incognito multidimension recod anonym method multi propos inconsist handl method balanc distort consist gener view index term anonym local recod gener distanc inconsist cluster pattern similar cluster process group set object class similar object definit similar vari cluster model model concept similar base distanc euclidean distanc cosin distanc word similar object requir close valu set dimens paper explor gener type similar pcluster model propos object similar exhibit coher pattern subset dimens instanc dna microarrai analysi express level gene rise fall synchron respons set environment stimuli magnitud express level close pattern exhibit alik discoveri cluster gene essenti reveal signific connect gene regulatori network commerc applic collabor filter benefit model captur close valu lead indic close purchas brows pattern exhibit custom paper introduc effect algorithm detect cluster perform test real synthet data set show effect advanc inform knowledg manag govern research recogn research domain polici strategi formul govern implement target year limit attent give long term egovrtd european commiss fund project investig futur research govern driven chang circumst evolut technolog project consist analysi state plai scenario build gap analysi roadmap activ paper roadmap methodolog fit uniqu characterist govern field present result briefli discuss methodolog result identif larg number govern research theme found roadmap methodolog match uniqu characterist govern research show multidisciplinari research effici skylin queri variabl user prefer nomin attribut current skylin evalu techniqu assum fix order attribut dynam prefer nomin attribut realist applic order gener onlin respons prefer issu user obviou solut enumer prefer materi result prefer pre process storag requir full materi typic prohibit propos semi materi method call ipo tree search store partial result partial result result prefer return effici conduct experi show effici propos algorithm advanc inform knowledg manag govern research recogn research domain polici strategi formul govern implement target year limit attent give long term egovrtd european commiss fund project investig futur research govern driven chang circumst evolut technolog project consist analysi state plai scenario build gap analysi roadmap activ paper roadmap methodolog fit uniqu characterist govern field present result briefli discuss methodolog result identif larg number govern research theme found roadmap methodolog match uniqu characterist govern research show multidisciplinari research survei anonym techniqu privaci preserv publish social network data nowadai partli driven web applic social network data made publicli analyz privaci preserv publish social network data import concern paper present systemat review exist anonym techniqu privaci preserv publish social network data identifi challeng privaci preserv publish social network data compar extens studi relat case examin problem formul import dimens privaci background knowledg data util survei anonym method privaci preserv categori cluster base approach graph modif approach proceed ph workshop cikm alpha danonym base privaci preserv lossi join ts dtree dalter search tree index trustworthi databas write donc dread dmani worm storag activ rule termin analysi condit formula updat variabl alpha danonym base privaci preserv lossi join ix dcube iceberg cube data wareh olap xml data mine api pattern partial order sourc code usag scenario specif softwar system interact parti librari api librari api follow usag pattern order rule specif exist api rule govern secur robust oper system api pattern rule document api develop previou approach mine frequent associ rule itemset subsequ captur api call pattern share api client code frequent api pattern complet captur order share api multipl api involv procedur paper present framework automat extract usag scenario user api partial order directli sourc code api client code adapt model checker gener interprocedur control flow sensit static trace relat api interest api usag scenario extract static trace scenario extract algorithm fed miner miner summar usag scenario compact partial order specif extract frequent partial order specif extract algorithm experi appli framework client loc total shown extract api partial order assist effect api reus check comput compress multidimension skylin cube effici recent skylin comput analysi extend singl full space multidimension subspac lead valuabl insight applic compress skylin cube form skylin group decis subspac provid succinct summar compress multidimension subspac skylin comput skylin cube remain challeng task exist method search exponenti number nonempti subspac subspac skylin paper propos effici method stellar exploit interest skylin group lattic small subset object skylin full space show skylin group lattic easi comput extend skylin group lattic object comput skylin full space stellar enumer skylin group decis subspac full space skylin object avoid search skylin exponenti number subspac improv effici scalabl subspac skylin comput substanti practic extens perform studi verifi merit method mine softwar engin data mine softwar engin data emerg success research direct past decad posit paper advoc softwar intellig si futur mine softwar engin data modern softwar engin research practic educ coin si inspir busi intellig bi field offer concept techniqu improv busi decis make fact base support system similarli si offer softwar practition develop date pertin inform support daili decis make process si support decisionmak process lifetim softwar system develop phase vision si realiti enabl softwar engin research strong impact modern softwar practic recent advanc mine softwar repositori msr field show great promis provid strong support realiz si futur posit paper summar state practic research si lai futur research direct mine softwar engin data enabl si mine favor facet clean disguis miss data heurist approach mine frequent trajectori pattern activ monitor radio frequenc tag arrai activ monitor crucial task applic conduct expens video camera effect monitor larg field analyz imag multipl camera remain challeng problem paper introduc applic recent develop rfid technolog rf tag arrai activ monitor data mine techniqu plai critic role rfid technolog econom attract solut due low cost rf tag reader novelti design track object attach transmitt receiv tag reader develop practic fault toler method offset nois rf tag data mine frequent trajectori pattern model regular activ empir studi real rfid system data set verifi feasibl effect design sketch landscap page farm web larg social network import interest understand ecolog web gener relat web page environ understand relat import applic includ web commun identif analysi web spam detect paper propos notion page farm set page contribut major portion pagerank score target page understand landscap page farm gener farm web page similar order sketch landscap page farm extract page farm extens show comput page farm np hard develop simpl greedi algorithm analyz farm larg number million page randomli sampl web report interest find importantli landscap page farm tend follow power law distribut landscap page farm strongli reflect import web page wat find top dk discord time seri databas find discord time seri databas import problem great varieti applic space shuttl telemetri mechan industri biomedicin financi data analysi previou method problem suffer paramet set difficult user approach knowledg compar fewer paramet requir user choos word size compress subsequ paper propos haar wavelet augment trie base algorithm mine top discord time seri databas dynam determin word size compress due characterist haar wavelet transform algorithm greater prune power previou approach experi annot dataset effect effici algorithm attest maintain danonym increment updat anonym simpl practic mechan protect privaci attack identifi individu join multipl public data sourc exist method achiev anonym assum implicitli data object anonym fix applic real world data sourc dynam paper investig problem maintain anonym increment updat propos simpl effect solut analyz infer multipl releas temper anonym data propos monoton increment anonym properti gener idea progress consist reduc gener granular increment updat arriv approach guarante kanonym releas infer tabl multipl releas time approach util accumul data reduc inform loss probabilist skylin uncertain data uncertain data inher import applic consider amount research dedic model uncertain data answer type queri uncertain data conduct advanc analysi uncertain data remain open problem larg paper tackl problem skylin analysi uncertain data propos probabilist skylin model uncertain object probabl skylin skylin object skylin probabl comput probabilist skylin larg uncertain data set challeng develop effici algorithm bottom algorithm comput skylin probabl select instanc uncertain object instanc prune instanc uncertain object effect top algorithm recurs partit instanc uncertain object subset prune subset object aggress experiment result real nba player data set benchmark synthet data set show probabilist skylin interest algorithm effici larg data set complementari perform minim attack privaci preserv data publish mail address constraint dbase sequenti pattern mine pattern dgrowth method constraint essenti sequenti pattern mine applic systemat studi constraint base sequenti pattern mine paper investig issu point framework develop constrain frequent pattern mine fit mission extend framework develop base sequenti pattern growth methodolog studi show constraint effect effici push deep sequenti pattern mine framework framework extend constraint base structur pattern mine effici answer top dk typic queri larg databas find typic instanc effect approach understand analyz larg data set paper appli idea typic analysi psycholog cognit scienc databas queri answer studi problem answer top typic queri model typic larg data set systemat answer question top typic nba player measur simpl typic develop answer question top typic guard distinguish guard player notion discrimin typic propos comput exact answer top typic queri requir quadrat time costli onlin queri answer larg databas develop seri approxim method situat random tournament algorithm linear complex provid theoret guarante qualiti answer direct local typic approxim vp tree approxim qualiti guarante vp tree exploit index larg set object typic queri answer effici qualiti guarante tournament method base local typic tree data structur extens perform studi real data set seri synthet data set show top typic queri meaning method practic effici skylin queri variabl user prefer nomin attribut current skylin evalu techniqu assum fix order attribut dynam prefer nomin attribut realist applic order gener onlin respons prefer issu user obviou solut enumer prefer materi result prefer pre process storag requir full materi typic prohibit propos semi materi method call ipo tree search store partial result partial result result prefer return effici conduct experi show effici propos algorithm effici skylin top dk retriev subspac skylin top queri popular oper prefer retriev practic applic requir oper provid numer candid attribut depend interest user issu queri subset dimens exist algorithm inadequ subspac skylin top search defect requir scan entir databas ii optim subspac incur signific overhead subspac iii demand expens mainten cost space consumpt paper propos techniqu subski settl type queri pure relat technolog core subski transform convert multidimension data valu valu index simpl tree answer subspac queri access fraction databas subski entail low mainten overhead equal cost updat tradit tree extens experi real data confirm techniqu outperform altern solut significantli effici scalabl energi deffici data collect framework wireless sensor network exploit spatiotempor correl constraint dbase sequenti pattern mine pattern dgrowth method constraint essenti sequenti pattern mine applic systemat studi constraint base sequenti pattern mine paper investig issu point framework develop constrain frequent pattern mine fit mission extend framework develop base sequenti pattern growth methodolog studi show constraint effect effici push deep sequenti pattern mine framework framework extend constraint base structur pattern mine answer ad hoc aggreg queri data stream prefix aggreg tree mine gene dsampl dtime microarrai data coher gene cluster discoveri approach introduct special issu data mine health informat minimum descript length principl gener prefer close pattern classif span correl data stream granular adapt densiti estim demand cluster concept ddrift data stream achiev danonym cluster attribut hierarch structur abstract individu privaci risk publish data set properli deidentifi anonym major techniqu de identifi data set gener view anonym cluster constraint minimum number object cluster exist approach achiev anonym cluster numer ordin attribut paper studi achiev anonym cluster attribut hierarch structur defin generalis distanc tupl characteris distort generalis discuss properti distanc conclud generalis distanc metric distanc propos effici cluster base algorithm anonymis experiment show propos method scalabl significantli distort optim global recod anonym method subski effici comput skylin subspac set multi dimension point skylin point prefer function monoton ax practic applic requir skylin analysi provid numer candid attribut user depend interest issu queri small subset dimens formal relat larg number gt attribut queri aim find skylin arbitrari subspac low dimension exist algorithm support subspac skylin retriev effici requir scan entir databas ii optim subspac incur signific overhead subspac paper propos techniqu subski settl problem singl tree implement relat databas core sky transform convert multi dimension data valu enabl effect prune heurist extens experi real data confirm subski outperform altern approach significantli effici scalabl improv group dentiti resolut quasi dcliqu entiti resolut er problem identifi duplic entiti refer real world entiti essenti applic paper focu resolv entiti group relat element author entiti list citat singer entiti song list intermedi result group sql queri entiti name group entiti frequent occur applic previou approach group entiti resolut reli textual similar produc larg number fals posit complement techniqu paper present experi appli recent propos graph mine techniqu quasi cliqu atop convent er solut approach exploit contextu inform mine group element entiti addit syntact similar extens experi verifi propos improv precis recal varieti exist er solut worsen effect approach entiti resolut problem quasi dcliqu applic digit librari studi resolv entiti group relat element author entiti list citat intermedi result group sql queri entiti name group entiti frequent occur applic exploit contextu inform mine group element entiti addit syntact similar show approach quasi cliqu improv precis recal varieti exist entiti resolut solut worsen privaci preserv adversari data mine privaci preserv data process import topic recent advanc hardwar technolog lead widespread prolifer demograph sensit data rudimentari preserv privaci simpli hide inform sensit field pick user method satisfactori abil prevent adversari data mine real data record randomli distribut result field record correl correl suffici high adversari predict sensit field field paper studi problem privaci preserv adversari data mine hide minim set entri privaci sensit field satisfactorili preserv word data mine adversari accur recov hidden data entri model problem concis develop effici heurist algorithm find good solut practic extens perform studi conduct synthet real data set examin effect approach categori subject descriptor databas applic data mine suppress model overfit mine concept ddrift data stream util dbase anonym local recod privaci concern applic involv microdata recent effici anonym attract research work previou method global recod map domain quasi identifi attribut gener chang valu global recod achiev effect anonym term discern queri answer accuraci anonym data anonym data analysi accept analyt applic attribut data set util analysi util attribut consid previou method paper studi problem util base anonym propos simpl framework util attribut framework cover numer categor data develop simpl effici heurist local recod method util base anonym extens perform studi real data set synthet data set show method outperform state art multidimension global recod method discern queri answer accuraci util base method boost qualiti analysi anonym data categori subject descriptor databas applic mapo mine api usag open sourc repositori improv softwar product construct softwar system develop reus exist class librari framework invok api api complex document pose barrier develop client code familiar api develop search web gener search engin find relev document code exampl develop sourc code search engin search open sourc repositori sourc file api number return sourc file larg difficult develop learn api usag larg number return result order develop understand api usag write api client code effect develop api usag mine framework support tool call mapo mine api usag open sourc repositori queri describ method class packag api mapo leverag exist sourc code search engin gather relev sourc file conduct data mine mine lead short list frequent api usag develop inspect mapo consist compon code search engin sourc code analyz sequenc preprocessor frequent sequenc miner frequent sequenc postprocessor examin effect mapo set queri preliminari result show framework practic provid inform succinct api usag pattern high dimension index support relev feedback base interact imag retriv multidimension subspac skylin analysi skylin oper import multicriteria decis make applic recent studi develop effici method comput skylin object space consid skylin multipl subspac simultan importantli fundament erratum push convert constraint frequent itemset mine recent work highlight import constraint base mine paradigm context frequent itemset associ correl sequenti pattern interest pattern larg databas paper studi constraint handl exist theori techniqu item arbitrari valu amp customarili regard tough constraint push insid algorithm apriori develop notion convert constraint systemat analyz classifi character class develop techniqu enabl readili push deep insid recent develop fp growth algorithm frequent itemset mine result detail experi show effect techniqu develop introduct recogn frequent pattern minin mine dlocat pattern rare event spatial data set discov frequent close partial order string abstract mine knowledg order sequenc data import problem applic bioinformat web mine network manag intrus detect custom follow partial order purchas seri product partial order predict relat custom futur purchas develop market campaign biolog sequenc microarrai data cluster base partial order share sequenc set item total order subset item repres string string databas multiset string paper identifi problem mine frequent close partial order string frequent close partial order captur nonredund interest order inform string databas importantli mine frequent close partial order discov meaning knowledg disclos previou data mine techniqu problem mine frequent close partial order challeng tackl problem develop frecpo frequent close partial order practic effici algorithm mine complet set frequent close partial order larg string databas interest prune techniqu devis speed search report extens perform studi real data set synthet data set illustr effect effici approach index term frequent pattern close pattern partial order string data mine regress cube lossless compress aggreg abstract olap engin wide support multidimension data analysi desir support data cube advanc statist measur regress filter addit tradit simpl measur count averag measur user model smooth predict trend pattern data exist algorithm simpl distribut algebra measur inadequ effici comput statist measur multidimension space paper propos fundament class measur compress measur order support effici comput statist model compress measur compress cell auxiliari matrix size independ number tupl comput statist measur data cell compress data lower level cell access raw data time space effici lossless aggreg formula deriv regress filter measur analyt experiment studi show result system regress cube substanti reduc memori usag respons time statist analysi multidimension data index term aggreg compress data cube olap close constrain gradient mine retail databas mine chang region access dconstrain snapshot cluster dembed decis tree approach util dbase anonym privaci preserv inform loss privaci concern applic involv microdata recent effici anonym attract research work previou method global recod map domain quasi identifi attribut gener chang valu global recod achiev effect anonym term discern queri answer accuraci anonym data anonym data analysi accept analyt applic attribut data set util analysi util attribut consid previou method paper studi problem util base anonym propos simpl framework util attribut framework cover numer categor data develop simpl effici heurist local recod method util base anonym extens perform studi real data set synthet data set show method outperform state art multidimension global recod method discern queri answer accuraci util base method boost qualiti analysi anonym data mine succinct system minim gener formal concept abstract formal concept analysi activ field studi data analysi knowledg discoveri formal concept determin extent set object fall intent set properti attribut cover intent call close itemset maximum set attribut character minim gener minim subset intent similarli character paper introduc succinct system minim gener ssmg minim represent minim gener concept effici algorithm mine ssmg ssmg reveal equival relationship minim gener import medic scientif discoveri reveal extent base semant equival associ ssmg losslessli reduc size represent minim gener similar close itemset losslessli reduc size represent frequent itemset remov redud human user grasp structur inform concept gener approach mine qualiti pattern dbase cluster microarrai data abstract pattern base cluster broad applic microarrai data analysi custom segment busi data analysi pattern base cluster return larg number highlyoverlap cluster make hard user identifi interest pattern mine result lack gener model pattern base cluster kind pattern measur pattern coher requir algorithm paper address problem propos gener qualiti driven approach mine top qualiti pattern base cluster examin qualiti driven approach real world microarrai data set experiment result show method gener effect effici onlin mine data stream applic techniqu progress mine cross dgraph quasi dcliqu gene express protein interact data effici mine frequent close partial order mine cross dgraph quasi dcliqu joint mine multipl data set discov interest reliabl pattern obtain sole singl sourc cross market custom segment group custom behav similarli multipl market consid coher reliabl cluster cluster found singl market bioinformat joint mine gene express data protein interact data find cluster gene show coher express pattern produc interact protein cluster potenti pathwai paper investig data mine problem mine cross graph quasi cliqu gener interest applic cross market custom segment joint mine gene express data protein interact data build gener model mine cross graph quasicliqu show complet set cross graph quasi cliqu found previou data mine method studi complex problem problem difficult develop effici algorithm crochet exploit interest effect techniqu heurist efficaci mine cross graph quasi cliqu systemat perform studi report synthet real data set demonstr interest meaning cross graph quasi cliqu bioinformat experiment result show algorithm crochet effici scalabl pattern dbase similar search microarrai data random method quantifi chang distribut data stream abstract applic fraud intrus detect great interest measur evolv trend data problem quantifi dataset class label tradition measur estim probabl distribut data comput distanc instanc diverg estim distribut approach computation infeas larg high dimension dataset problem challeng stream data environ high speed make difficult learn process concept drift data tackl problem propos method quantifi concept drift univers model incur minim learn cost addit model abil perform classif cross tabl cube mine iceberg cube data warehous graphmin structur pattern dmine system larg disk dbase graph databas applic mine gener multidimension summar group data warehous catch view skylin semant approach base decis subspac skylin oper import multicriteria decis make applic recent studi develop effici method comput skylin object specif space fundament problem semant skylin remain open subspac object skylin practic user interest skylin subspac relationship skylin subspac super space effect analyz subspac skylin effici comput skylin subspac paper investig semant skylin propos subspac skylin analysi extend full space skylin comput subspac skylin comput introduc notion skylin group essenti group object coincident skylin subspac identifi decis subspac qualifi skylin group subspac skylin notion concis captur semant structur skylin subspac multidimension roll drilldown analysi introduc develop stratif dbase approach accur fast imag annot stream cube architectur multi ddimension analysi data stream interact approach mine gene express data effect identif express gene coher pattern gene express data import task bioinformat research biomed applic cluster method recent propos identifi express gene share similar coher ent pattern object standard group express gene interpret express heavili depend domain knowledg group express gene gene express data highli connect larg number intermedi gene clear boundari separ cluster cluster gene express data face challeng satisfi biolog domain requir address high connect data set prefer dbase frequent pattern mine book review mind live discoveri great comput scientist recent neurolog studi role emot human cognit essenti emot luxuri emot plai critic role ration decis make percept human interact human intellig fact combin abil comput acquir express recogn affect open area research paper defin kei issu affect comput comput relat aris deliber influenc emot model suggest comput recognit human emot theoret practic applic learn human comput interact perceptu inform retriev creativ art entertain human health machin intellig signific potenti advanc emot cognit theori hing develop affect comput form wearabl comput paper establish challeng futur direct emerg field prefac comwim data mine intrus detect techniqu applic system scalabl mine larg disk dbase graph databas mine frequent structur pattern graph databas interest problem broad applic previou studi focu prune unfruit search subspac effect address mine larg disk base databas graph databas applic held main memori scalabl mine larg disk base graph databas remain challeng problem paper develop effect index structur adi adjac index support mine graph pattern larg databas held main memori index simpl effici build index structur easili adopt exist graph pattern mine algorithm adapt gspan algorithm adi structur experiment result show index structur enabl scalabl graph pattern mine larg databas set experi disk base method mine graph databas million graph origin gspan algorithm handl databas thousand graph method faster gspan run main memori mine coher gene cluster gene dsampl dtime microarrai data extens studi shown mine microarrai data set import bioinformat research biomed applic paper explor type genesampl time microarrai data set record express level gene set sampl seri time point propos mine coher gene cluster data set cluster subset gene subset sampl gene coher sampl time seri coher gene cluster identifi sampl phenotyp diseas suggest candid gene correl phenotyp present effici algorithm sampl gene search gene sampl search mine complet set coher gene cluster empir evalu perform approach real microarrai data set synthet data set test result shown approach effici effect find meaning coher gene cluster effici pattern dgrowth method frequent tree pattern mine fast algorithm subspac cluster pattern similar gpx interact mine gene express data mine frequent pattern candid gener frequent dpattern tree approach mine frequent pattern transact databas time seri databas kind databas studi popularli data mine research previou studi adopt apriori candid set gener test approach candid set gener costli exist larg number pattern long pattern studi propos frequent pattern tree fp tree structur extend prefix tree structur store compress crucial inform frequent pattern develop effici fp tree base mine method fp growth mine complet set frequent pattern pattern fragment growth effici mine achiev techniqu larg databas compress condens smaller data structur fp tree avoid costli repeat databas scan fp tree base mine adopt pattern fragment growth method avoid costli gener larg number candid set partit base divid conquer method decompos mine task set smaller task mine confin pattern condit databas dramat reduc search space perform studi show fp growth method effici scalabl mine long short frequent pattern order magnitud faster apriori algorithm faster recent report frequent pattern mine method push convert constraint frequent itemset mine mine sequenti pattern pattern dgrowth prefixspan approach sequenti pattern mine import data mine problem broad applic difficult problem mine gener examin combinatori explos number intermedi subsequ previous develop sequenti pattern mine method gsp explor candid gener test approach reduc number candid examin approach effici mine larg sequenc databas numer pattern long pattern paper propos project base sequenti pattern growth approach effici mine sequenti pattern approach sequenc databas recurs project set smaller project databas sequenti pattern grown project databas explor local frequent fragment base initi studi pattern growth base sequenti pattern mine freespan propos effici method call psp offer order growth reduc project databas improv perform pseudoproject techniqu develop prefixspan comprehens perform studi show prefixspan case outperform priori base algorithm gsp freespan spade sequenti pattern mine algorithm adopt vertic data format prefixspan integr pseudoproject fastest test algorithm mine methodolog extend mine sequenti pattern user constraint high promis pattern growth approach lead extens effici mine kind frequent pattern frequent substructur mine constrain gradient larg databas data analysi task view search mine multidimension space md mdss dimens captur potenti import factor applic cell repres combin valu factor systemat analyz data md terest notion call cubegrad recent introduc imielinski al ika focus notabl measur md compar cell refer probe cell gradient cell ancestor descend sibl call queri gradient analysi queri gq md billion cell import answer gq effici studi focu develop effici method mine gq constrain weakli anti monoton constraint conduct independ gradient cell search probe cell ineffici due repeat work propos effici algorithm liveset driven algorithm find good gradient probe cell pair search pass util measur analysi dimens match analysi set orient manner achiev bi direct prune set hope probe cell hope gradient cell adopt hyper tree structur cube sequenti pattern mine structur pattern mine pattern dgrowth approach mine condens frequent dpattern base frequent pattern mine studi extens effect effici mine limit number frequent pattern gener larg applic suffici gener examin frequent pattern support frequenc close approxim full precis compact close frequent pattern base call condens frequent pattern base dhc densiti dbase hierarch cluster method time seri gene express dat gener model onlin analyt process complex data abstract recogn onlin analyt process olap provid import insight huge archiv data convent olap model capabl analyz relat busi data fit kind complex data emerg applic bio medic data time seri semi structur data paper propos golap gener olap model show golap consist convent olap model multidimension databas show model appli complex data illustr research prototyp system genexplor enabl olap gene express data mapl fast algorithm maxim pattern dbase cluster mine type arbitrarili posit overlap cluster genet data find interest pattern closet search strategi mine frequent close itemset mine frequent close itemset complet nonredund result frequent pattern analysi extens studi propos strategi effici frequent close itemset mine depth search breadthfirst search vertic format horizont format treestructur data structur top bottomup travers pseudo project physic project condit databas time pro con strategi pick integr strategi achiev higher perform gener case studi answer question systemat studi search strategi develop win algorithm closet closet integr advantag previous propos effect strategi newli develop perform studi synthet real data set shown advantag strategi improv closet exist mine algorithm includ closet charm op term runtim memori usag scalabl interact explor coher pattern time dseri gene express data discov coher gene express pattern time seri gene express data import task bioinformat research biomed applic paper propos interact explor framework mine coher express pattern time seri gene express data develop tool coher pattern index graph give user highli confid indic exist coher pattern deriv coher pattern index graph devis attract tree structur record gene data set summar inform need interact explor present fast scalabl algorithm construct attract tree coher pattern index graph gene express data set conduct extens perform studi real data set verifi design experiment result strongli show approach effect state art method mine real gene express data scalabl mine larg data set mine phenotyp inform gene gene express data mine microarrai gene express data import research topic bioinformat broad applic previou studi focu cluster gene sampl interest partit complet set sampl exclus group call phenotyp find set inform gene manifest phenotyp structur paper propos problem simultan mine phenotyp inform gene gene express data statist base metric propos measur qualiti mine result interest algorithm develop heurist search mutual reinforc adjust method present extens perform studi real world data set synthet data set mine result propos method previou method readi real world applic method mutual reinforc adjust method gener scalabl effect qualiti mine result mine confid coloc rule support threshold approxmap approxim mine consensu sequenti pattern convent sequenti pattern mine method meet inher difficulti mine databas long sequenc nois gener huge number short trivial pattern fail find interest pattern approxim share sequenc paper propos theme approxim sequenti pattern mine roughli defin identifi pattern approxim share sequenc present effici effect algorithm approxmap mine consensu pattern larg sequenc databas step sequenc cluster similar consensu pattern mine directli cluster multipl align real case studi illustr effect approxmap qc dtree effici summari structur semant olap socqet semant olap compress cube summar efficaci data cube explor semant summar compress data cube core oper data wareh olap effici comput mainten util queri answer advanc analysi subject numer studi applic huge size data cube limit applic mean semant explor user recent develop recent progress select topic databas research report young chines research work unit state interact explor gene express pattern mine sequenti pattern constraint larg databas constraint essenti sequenti pattern mine applic systemat studi constraint base sequenti pattern mine paper investig issu point framework develop constrain frequent pattern mine fit mission extend framework develop base sequenti pattern growth methodolog studi show constraint effect effici push deep sequenti pattern mine framework framework extend constraint base structur pattern mine onlin analyt process stream data feasibl real time surveil system dynam environ ment gener tremend potenti infinit vol um stream data volum huge scan multipl time data resid low level abstract analyst interest dynam trend outlier high level abstract discov high level characterist perform line multi level analysi stream data similar olap line analyt process relat data warehous data comput condens frequent pattern base frequent pattern mine studi extens effect effici mine limit number frequent pattern gener larg applic suffici gener examin frequent pattern support frequenc close approxim full precis compact close frequent pattern base call condens frequent pattern base commix effect web inform extract cubeexplor onlin explor data cube quotient cube summar semant data cube partit data cube set cell similar behavior expos semant cube find averag boot sale west store walmart winter year signifi interest trend boot sale locat year paper interest find succinct summari data cube exploit regular present cube clear basi summari concis form lattic preserv rollup drilldown semant cube iii origin cube fulli recov constrain frequent pattern mine pattern dgrowth view multi ddimension sequenti pattern mine recent develop sequenti pattern mine algorithm prefixspan mine sequenti user access pattern web log inform redesign web site easier perus fewer network traffic bottleneck richer incorpor multipl dimens inform knew referr site user frequent determin inform web site interest enhanc separ inform need similarli knew weekdai time access pattern frequent occur ensur updat inform readi user thesi propos explor techniqu hybrid psfp incorpor addit dimens inform process mine sequenti pattern investig strength limit approach hybrid method find frequent dimens combin mine sequenti pattern set sequenc satisfi combin psfp approach problem opposit direct mine sequenti pattern dataset prefixspan mine frequent dimens pattern alongsid sequenti pattern exist associ algorithm fp growth experi show hybrid effect low support dataset spars respect dimens combin dens respect sequenti pattern present psfp altern case includ dataset dens respect dimens valu combin sequenti fault dtoler frequent pattern mine problem challeng prefixspan mine sequenti pattern prefix dproject growth mine frequent item set convert constraint cmar accur effici classif base multipl class dassoci rule dmine hyper dstructur mine frequent pattern larg databas method effici mine frequent pattern studi extens research previous propos method encount perform bottleneck mine databas data characterist dens spars long short pattern memori base disk base scalabl frequent dpattern mine method overview effici comput iceberg cube complex measur expens comput materi complet high dimension data cube comput iceberg cube aggreg threshold effect deriv nontrivi multidimension aggreg olap data mine paper studi effici method comput iceberg cube popularli complex measur averag develop methodolog adopt weaker anti monoton condit test prune search space effici comput iceberg cube averag measur propos top averag prune method extend previous studi method apriori buc top apriori top buc improv perform interest hypertre structur call tree design iceberg cube method call top cube develop perform studi show top buc top cube promis candid scalabl comput top cube perform case dna dminer system prototyp mine dna sequenc mine frequent pattern candid gener paper propos data structur call cat tree cat tree extend idea fptree improv storag compress frequent pattern mine gener candid itemset propos algorithm enabl frequent pattern mine support rebuild tree structur algorithm mine singl pass databas effici insert delet transact time mine multi ddimension constrain gradient data cube introduct recent year grow interest multi dimension analysi relat databas transact closet effici algorithm mine frequent close itemset associ mine deriv undesir larg set frequent itemset associ rule recent studi propos interest altern mine frequent close itemset rule power associ mine substanti reduc number rule present paper propos effici algorithm closet mine close itemset develop techniqu appli compress frequent pattern tree fp tree structur mine close itemset candid gener develop singl prefix path compress techniqu identifi frequent close itemset quickli explor partit base project mechan scalabl mine larg databas perform studi show closet effici scalabl larg databas faster previous propos method introduct recogn frequent pattern minin push constraint frequent pattern mine freespan frequent pattern dproject sequenti pattern mine mine frequent pattern larg databas plai essenti role data mine task broad applic previous propos method adopt apriorilik candid gener test approach method encount challeng mine dataset prolif pattern long pattern mine access pattern effici web log explos growth data world wide web discoveri analysi inform world wide web practic necess web access pattern sequenc access pursu user frequent kind interest knowledg practic paper studi problem mine access pattern web log effici data structur call web access pattern tree wap tree short develop effici mine access pattern piec log web access pattern tree store highli compress critic inform access pattern mine facilit developmentofnovel algorithm mine access pattern larg set log piec algorithm find access pattern web log effici experiment perform studi show method gener order magnitud faster convent method mine frequent pattern candid gener paper propos data structur call cat tree cat tree extend idea fptree improv storag compress frequent pattern mine gener candid itemset propos algorithm enabl frequent pattern mine support rebuild tree structur algorithm mine singl pass databas effici insert delet transact time data mine benchmark testb perform studi frequent pattern mine mine frequent pattern pattern dgrowth methodolog implic 